Algebra Universalis Structural entailment

نویسندگان

  • Brian A. Davey
  • Miroslav Haviar
  • Ross Willard
چکیده

We give a number of characterizations of structural entailment. In particular, we show that an alter ego M∼ structurally entails an algebraic relation s on a finite algebra M if and only if s can be obtained via a local construct from M∼ . We show, via a range of applications, that, whereas entailment is important in the study of dualisability, structural entailment is important in the study of full and strong dualisability. We also give an application to the transfer of strong dualities that connects this paper to our earlier paper [9] on full versus strong duality. The concept of structural entailment has been around since the birth of the theory of natural dualities in 1980 (see Davey and Werner [11]). Nevertheless, until now its weaker cousin, entailment, has received all of the attention. It is significant that, until this paper and its companion [9], the concept did not even have a name. In their seminal paper [8] on the syntax and semantics of entailment, Davey, Haviar and Priestley characterised entailment but did not consider structural entailment at all. In this paper we redress the balance. Once we state and prove the Structural Entailment Theorem (in Section 2) and consider its many applications (in Sections 3 and 4) it becomes clear why structural entailment hardly rated a mention in earlier work on entailment. Previously, authors considering entailment have been motivated by questions concerned with dualisability. Our results make it clear that, while structural entailment is important in connection with dualisability, its most important applications arise in connection with strong dualisability and the more inscrutable full dualisability. In Section 1, we give a brief introduction to natural duality theory tailored to our particular needs. Those familiar with dualisability, full dualisability, strong dualisability and entailment may wish to begin with Section 2, where structural entailment is defined and characterised, referring to Section 1 as needed. 1. Dualisability and all that it entails Here we shall give a very brief refresher on the basics of natural dualities. The definitions of dualisability, full dualisability and strong dualisability will be recalled, Presented by R. W. Quackenbush. Received June 27, 2003; accepted in final form May 12, 2005. 2000 Mathematics Subject Classification: 08C05; 08C15, 18A40.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Belief Revision and Nonmonotonic Entailment: Results and Proofs

An algebraic approach to AGM belief revision and nonmonotonic entailment is defined. Results are stated and detailed proofs given. However this is not a survey article so the literature is not reviewed nor is there much reflective discussion. The algebra, PSEN, is a preboolean algebra whose elements are sets of sentences and whose order relation is restricted entailment. Restricted entailment i...

متن کامل

An Algebraic Approach to Belief Contraction and Nonmonotonic Entailment

The approach of Alchourrón, Gärdenfors and Makinson to belief contraction is treated algebraically. This is then used to give an algebraic treatment of nonmonotonic entailment in the context of a belief set. The algebra used is a preboolean algebra whose elements are sets of sentences and whose order relation is restricted entailment. Under plausible assumptions restricted entailment is computa...

متن کامل

Paradox, Closure and Indirect Speech Reports

Bradwardine’s solution to the the logical paradoxes depends on the idea that every sentence signifies many things, and its truth depends on things’ being wholly as it signifies. This idea is underpinned by his claim that a sentence signifies everything that follows from what it signifies. But the idea that signification is closed under entailment appears too strong, just as logical omniscience ...

متن کامل

Information Algebras and Consequence Operators

We explore a connection between different ways of representing information in computer science. We show that relational databases, modules, algebraic specifications and constraint systems all satisfy the same ten axioms. A commutative semigroup together with a lattice satisfying these axioms is then called an “information algebra”. We show that any compact consequence operator satisfying the in...

متن کامل

Entailment Relations and Distributive Lattices

To any entailment relation Sco74] we associate a distributive lattice. We use this to give a construction of the product of lattices over an arbitrary index set, of the Vietoris construction, of the embedding of a distributive lattice in a boolean algebra, and to give a logical description of some spaces associated to mathematical structures.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006